Bicyclic molecular graphs with the greatest energy

The Minimum Matching Energy of Bicyclic Graphs with given Girth

The matching energy of a graph was introduced by Gutman and Wagner in 2012 and defined as the sum of the absolute values of zeros of its matching polynomial. Let θ(r, s, t) be the graph obtained by fusing two triples of pendant vertices of three paths Pr+2, Ps+2 and Pt+2 to two vertices. The graph obtained by identifying the center of the star Sn−g with the degree 3 vertex u of θ(1, g−3, 1) is ...

On the harmonic index of bicyclic graphs

The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...

The signless Laplacian coefficients and incidence energy of bicyclic graphs

Article history: Received 7 February 2013 Accepted 15 October 2013 Available online 4 November 2013 Submitted by S. Kirkland

Semiharmonic bicyclic graphs

Classification of harmonic and semiharmonic graphs according to their cyclomatic number became of interest recently. All finite harmonic graphs with up to four independent cycles, as well as all finite semiharmonic graphs with at most one cycle were determined. Here, we determine all finite semiharmonic bicyclic graphs. Besides that, we present several methods to construct semiharmonic graphs f...

On bicyclic reflexive graphs